More about λ-support iterations of (<λ)-complete forcing notions

نویسندگان

  • Andrzej Roslanowski
  • Saharon Shelah
چکیده

This article continues Ros lanowski and Shelah [8, 9, 10, 11, 12] and we introduce here a new property of (<λ)–strategically complete forcing notions which implies that their λ–support iterations do not collapse λ (for a strongly inaccessible cardinal λ).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iteration of λ-complete forcing notions not collapsing λ

We look for a parallel to the notion of " proper forcing " among λ-complete forcing notions not collapsing λ +. We suggest such a definition and prove that it is preserved by suitable iterations. This work follows [Sh 587] and [Sh 667] (and see history there), but we do not rely on those papers. Our goal in this and the previous papers is to develop a theory parallel to " properness in CS itera...

متن کامل

On Iterated Forcing for Successors of Regular Cardinals

We investigate the problem of when ≤ λ–support iterations of < λ–complete notions of forcing preserve λ. We isolate a property — properness over diamonds — that implies λ is preserved and show that this property is preserved by λ–support iterations. Our condition is a relative of that presented in [1]; it is not clear if the two conditions are equivalent. We close with an application of our tec...

متن کامل

- 1 6 Not Collapsing Cardinals ≤ Κ in ( < Κ ) – Support Iterations

We deal with the problem of preserving various versions of completeness in (< κ)–support iterations of forcing notions, generalizing the case " S–complete proper is preserved by CS iterations for a stationary co-stationary S ⊆ ω 1 ". We give applications to Uniformization and the Whitehead problem. In particular, for a strongly inaccessible cardinal κ and a stationary set S ⊆ κ with fat complem...

متن کامل

Reasonable Ultrafilters, Again

We continue investigations of reasonable ultrafilters on uncount-able cardinals defined in Shelah [8]. We introduce stronger properties of ul-trafilters and we show that those properties may be handled in λ–support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal λ with generating system of siz...

متن کامل

A parallel to the null ideal for inaccessible λ: Part I

It is well known to generalize the meagre ideal replacing ℵ 0 by a (regular) cardinal λ > ℵ 0 and requiring the ideal to be λ +-complete. But can we generalize the null ideal? In terms of forcing, this means finding a forcing notion similar to the random real forcing, replacing ℵ 0 by λ, so requiring it to be (< λ)-complete. Of course, we would welcome additional properties generalizing the one...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Arch. Math. Log.

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2013